package net.tp.algo.lcs;

/**
 *
 * <p>Longest common subsequence.</p>
 *
 * <p>Given two string $X$, $Y$, let $X_i$ be the substring of X length $i$, $x_i$ be the character of X at index $i$.
 * Let $M[i,j]$ is the lcs of string $X_i$ and $Y_j$.</p>
 *
 * $$ M[i,j] = \{\table 0                      , i=0 \text" or " j=0;
 *                      M[i-1,j-1]             , {i,j} &gt; 0 \text" and " x_{i-1} = y_{j-1};
 *                      max(M[i,j-1], M[i-1,j]), {i,j} &gt; 0 \text" and " x_{i-1} ≠ y_{j-1} $$
 *
 * @author Trung Phan
 */
public class LCS {
}
